Graph drawing using tabu search coupled with path relinking
نویسندگان
چکیده
منابع مشابه
Graph Partitioning Using Tabu Search
In this paper, we present another approach to the balanced minimum cut graph partitioning problem. This approach is based on the meta-heuristic known as tabu search. Our experimental results compare favorably with two of the most effecitive methods available in terms of quality of solutions and computational times. Our experience and experiments suggest that this technique can be applied effect...
متن کاملPath Relinking with Multi-Start Tabu Search for the Quadratic Assignment Problem
This paper introduces a new path relinking algorithm for the well-known quadratic assignment problem (QAP) in combinatorial optimization. The QAP has attracted considerable attention in research because of its complexity and its applicability to many domains. The algorithm presented in this study employs path relinking as a solution combination method incorporating a multistart tabu search algo...
متن کاملScatter Search and Path Relinking
–The evolutionary approach called scatter search, and its generalized form called path relinking, originated from strategies for creating composite decision rules and surrogate constraints. Recent studies demonstrate the practical advantages of these approaches for solving a diverse array of optimization problems from both classical and real world settings. Scatter search and path relinking con...
متن کاملA tabu search/path relinking algorithm to solve the job shop scheduling problem
We present an algorithm that incorporates a tabu search procedure into the framework of path relinking to tackle the job shop scheduling problem (JSP). This tabu search/path relinking (TS/PR) algorithm comprises several distinguishing features, such as a specific relinking procedure and a reference solution determination method. To test the performance of TS/PR, we apply it to tackle almost all...
متن کاملFundamentals of Scatter Search and Path Relinking
The evolutionary approach called Scatter Search, and its generalized form called Path Relinking, have proved unusually effective for solving a diverse array of optimization problems from both classical and real world settings. Scatter Search and Path Relinking differ from other evolutionary procedures, such as genetic algorithms, by providing unifying principles for joining solutions based on g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLOS ONE
سال: 2018
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0197103